t = int(input())
while (t):
n = int(input())
a = []
s = input()
s = s.split(' ')
for i in range(n):
a.append(int(s[i]))
count = [0, 0]
for i in range(n):
count[a[i] % 2] = count[a[i] % 2] + 1
if count[0] and count[1]:
print('NO')
else:
print('YES')
t = t-1
#include<bits/stdc++.h>
using namespace std;
int main(){
int t;
cin>>t;
for(int l=0 ; l<t ; l++){
int n;
cin>>n;
int arr[n];
int odd=0, even=0;
for(int i=0 ; i<n ; i++){
cin>>arr[i];
if(arr[i]%2==0){
even++;
}
else{
odd++;
}
}
if(even==0 || odd==0){
cout<<"YES"<<endl;
}
else{
cout<<"NO"<<endl;
}
}
return 0;
}1605B - Reverse Sort | 1607C - Minimum Extraction |
1604B - XOR Specia-LIS-t | 1606B - Update Files |
1598B - Groups | 1602B - Divine Array |
1594B - Special Numbers | 1614A - Divan and a Store |
2085. Count Common Words With One Occurrence | 2089. Find Target Indices After Sorting Array |
2090. K Radius Subarray Averages | 2091. Removing Minimum and Maximum From Array |
6. Zigzag Conversion | 1612B - Special Permutation |
1481. Least Number of Unique Integers after K Removals | 1035. Uncrossed Lines |
328. Odd Even Linked List | 1219. Path with Maximum Gold |
1268. Search Suggestions System | 841. Keys and Rooms |
152. Maximum Product Subarray | 337. House Robber III |
869. Reordered Power of 2 | 1593C - Save More Mice |
1217. Minimum Cost to Move Chips to The Same Position | 347. Top K Frequent Elements |
1503. Last Moment Before All Ants Fall Out of a Plank | 430. Flatten a Multilevel Doubly Linked List |
1290. Convert Binary Number in a Linked List to Integer | 1525. Number of Good Ways to Split a String |